Ant Colony with Dynamic Local Search for the Time Scheduling of Transport Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Colony with Dynamic Local Search for the Time Scheduling of Transport Networks

This article presents an ant colony optimization for the time scheduling of public transport traffic. In fact, the assistance of a decision support system becomes necessary for the real-time regulation of this transport networks since the size of the search space increases exponentially with the number of vehicles and stops. So, we propose an ant colony algorithm with dynamic local search, in t...

متن کامل

Static Multi-processor Scheduling with Ant Colony Optimisation & Local Search

Efficient multi-processor scheduling is essentially the problem of allocating a set of computational jobs to a set of processors to minimise the overall execution time. There are many variations of this problem, most of which are NP-hard, so we must rely on heuristics to solve real world problem instances. This dissertation describes several novel approaches using the ant colony optimisation (A...

متن کامل

Ant Colony Optimization Algorithms with Local Search for the Dynamic Vehicle Routing Problem

This report demonstrates the use of effective local search to improve the performance of simple Ant Colony Optimization (ACO) algorithms as applied to an extension of the Vehicle Routing Problem (VRP) known as the Dynamic Vehicle Routing Problem (DVRP). The static VRP presents all orders a priori, however the DVRP requires scheduling to begin without a complete knowledge of all customer’s locat...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Airline Disruption Management - Dynamic Aircraft Scheduling with Ant Colony Optimization

Disruption management is one of the main concerns of any airline company, as it can influence its annual revenue by upwards of 3%. Most of medium to large airlines have specialized teams which focus on recovering disrupted schedules with very little automation. This paper presents a new automated approach to solve both the Aircraft Assignment Problem (AAP) and the Aircraft Recovering Problem (A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computers Communications & Control

سال: 2006

ISSN: 1841-9836,1841-9836

DOI: 10.15837/ijccc.2006.4.2313